A Novel Abstraction Framework for Online Planning
نویسندگان
چکیده
Abstractions are a useful tool for computing policies in large domains modeled as a Markov Decision Process. Prior work in this field is mostly focused on developing different notions for state abstractions. In this paper, we develop a novel framework for abstractions, which unifies prior work and directly exploits symmetry at the state-action pair level, thereby uncovering a much larger number of symmetries in a given domain. We describe the application of abstractions computed through this framework in UCT, a popular MCTS technique for online planning.ions are a useful tool for computing policies in large domains modeled as a Markov Decision Process. Prior work in this field is mostly focused on developing different notions for state abstractions. In this paper, we develop a novel framework for abstractions, which unifies prior work and directly exploits symmetry at the state-action pair level, thereby uncovering a much larger number of symmetries in a given domain. We describe the application of abstractions computed through this framework in UCT, a popular MCTS technique for online planning.
منابع مشابه
Counterexample-guided Abstraction Refinement for Classical Planning Master’s Thesis
Counterexample-guided abstraction refinement (CEGAR) is amethodological framework for incrementally computing abstractions of transition systems. We propose a CEGAR algorithm for computing abstraction heuristics for optimal classical planning. Starting from a coarse abstraction of the planning task, we iteratively compute an optimal abstract solution, check if and why it fails for the concrete ...
متن کاملASAP-UCT: Abstraction of State-Action Pairs in UCT
Monte-Carlo Tree Search (MCTS) algorithms such as UCT are an attractive online framework for solving planning under uncertainty problems modeled as a Markov Decision Process. However, MCTS search trees are constructed in flat state and action spaces, which can lead to poor policies for large problems. In a separate research thread, domain abstraction techniques compute symmetries to reduce the ...
متن کاملExplaining the Government Functional Role in Spatial Planning and Management within the Framework of Neoliberalism
Introduction and Background: With the ever-increasing superiority of neoliberalism views and decreasing government investments in public affairs since the 1980s, the functional and ownership roles of the government have been reduced. These functions replaced by the actively growing roles of corporations and nongovernmental institutions in space development and management. For instance, the inde...
متن کاملExtending PDDL for Hierarchical Planning and Topological Abstraction
Despite major progress in AI planning over the last few years, many interesting domains remain challenging for current planners. Topological abstraction can reduce planning complexity in several domains, decomposing a problem into a two-level hierarchy. This paper presents LAP, a planning model based on topological abstraction. In formalizing LAP as a generic planning framework, the support of ...
متن کاملDiverse and Additive Cartesian Abstraction Heuristic
We have recently shown how counterexample-guided abstraction refinement can be used to derive informative Cartesian abstraction heuristics for optimal classical planning. In this work we introduce two methods for producing diverse sets of heuristics within this framework, one based on goal facts, the other based on landmarks. In order to sum the heuristic estimates admissibly we present a novel...
متن کامل